Honest elementary degrees and degrees of relative provability without the cupping property

نویسنده

  • Paul Shafer
چکیده

An element a of a lattice cups to an element b > a if there is a c < b such that a∪c = b. An element of a lattice has the cupping property if it cups to every element above it. We prove that there are non-zero honest elementary degrees that do not have the cupping property, which answers a question of Kristiansen, Schlage-Puchta, and Weiermann [17]. In fact, we show that if b is a sufficiently large honest elementary degree, then b has the anti-cupping property, which means that there is an a with 0 <E a <E b that does not cup to b. For comparison, we also modify a result of Cai [8] to show, in several versions of the degrees of relative provability that are closely related to the honest elementary degrees, that in fact all non-zero degrees have the anti-cupping property, not just sufficiently large degrees.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Streamlined subrecursive degree theory

The study of honest elementary degrees has its roots in subrecursion theory from the nineteen seventies. Some relevant papers are Meyer & Ritchie [12] and Machtey [9–11]. These papers deal with subrecursive function classes being generated by so-called honest functions where an honest function is defined relative to a subrecursive class S and a model of computation: a function f : N → N is hone...

متن کامل

On the structure of honest elementary degrees

We present some new results, and survey some old results, on the structure of honest elementary degrees. This paper should be a suitable first introduction to the honest elementary degrees.

متن کامل

Measure and Cupping in the Turing Degrees

We answer a question of Jockusch by showing that the measure of the Turing degrees which satisfy the cupping property is 0. In fact, every 2-random degree has a strong minimal cover, and so fails to satisfy the cupping

متن کامل

The Strongest Nonsplitting Theorem

Sacks [14] showed that every computably enumerable (c.e.) degree ≥ 0 has a c.e. splitting. Hence, relativising, every c.e. degree has a Δ2 splitting above each proper predecessor (by ‘splitting’ we understand ‘nontrivial splitting’). Arslanov [1] showed that 0′ has a d.c.e. splitting above each c.e. a < 0′. On the other hand, Lachlan [9] proved the existence of a c.e. a > 0 which has no c.e. sp...

متن کامل

On the Structure of the Degrees of Relative Provability

We investigate the structure of the degrees of provability, which measure the proof-theoretic strength of statements asserting the totality of given computable functions. The degrees of provability can also be seen as an extension of the investigation of relative consistency statements for firstorder arithmetic (which can be viewed as Π1-statements, whereas statements of totality of computable ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 168  شماره 

صفحات  -

تاریخ انتشار 2017